Strong nondeterministic turing reduction—A technique for proving intractability
نویسندگان
چکیده
منابع مشابه
Improved Simulation of Nondeterministic Turing Machines
The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in the running time of the NTM. The graph is the natural one defined by the configurations of the NTM. All methods in the literature have required time linear in the size S of this graph. This paper presents a new simulation method ...
متن کاملNondeterministic One-Tape Off-Line Turing Machines
Finite state control Semi-infinite tape which contains, at the beginning of the computation: the input string, on its part of the tape the blank symbol, in the remaining squares According to the transition function at each step the machine: changes its internal state writes a nonblank symbol on the scanned tape square moves the head either to the left, or to the right, or keeps it on the same s...
متن کاملCombinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines
We introduce new techniques for proving quadratic lower bounds for deterministic and nondeterministic 1-tape Turing machines (all considered Turing machines have an additional one-way input tape). In particular, we derive for the simulation of 2-tape Turing machines by 1-tape Turing machines an optimal quadratic lower bound in the deterministic case and a nearly optimal lower bound in the nonde...
متن کاملStrong Turing Degrees for Additive BSS RAM's
For the additive real BSS machines using only constants 0 and 1 and order tests we consider the corresponding Turing reducibility and characterize some semidecidable decision problems over the reals. In order to refine, step-by-step, a linear hierarchy of Turing degrees with respect to this model, we define several halting problems for classes of additive machines with different abilities and c...
متن کاملA Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of strings is in this class if and only if there is a formula of the form ∃f1· · ∃fk∃R1· · ∃Rm∀xφ that is true exactly for all strings in L. In this formula the fi are unary function symbols, the Ri are unary relation symbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90017-2